Bounded time-stamping in message-passing systems

On Depth-bounded Message Passing Systems

Implementing Causal Ordering with Bounded Time stamps

This paper investigates a solution to the problem of causal ordering in message passing distributed systems Causal ordering is the restriction that messages are delivered in a fo fashion with respect to the global causal order between events in the system This is stronger than the condition that each local channel is fo In our algorithm causal ordering is implemented by having each process main...

Temporal Proof Methodologies for Timed Transition Systems 1;2

We extend the speciication language of temporal logic, the corresponding veriication framework, and the underlying computational model to deal with real-time properties of reactive systems. The abstract notion of timed transition systems generalizes traditional transition systems conservatively: qualitative fairness requirements are replaced (and superseded) by quantitative lower-bound and uppe...

Analyzing the Fault-Containment Time of Self-Stabilizing Algorithms - A Case Study for Graph Coloring

The paper presents techniques to derive upper bounds for the mean time to recover from a single fault for self-stabilizing algorithms in the message passing model. For a new ∆ + 1-coloring algorithm we analytically derive a bound for the mean time to recover and show that the variance is bounded by a small constant independent of the network’s size. For the class of bounded-independence graphs ...

Analysis of Message Passing Programs Using SMT-Solvers

We consider message passing programs where processes communicate asynchronously over unbounded channels. The reachability problem for such systems are either undecidable or have very high complexity. In order to achieve efficiency, we consider the phase-bounded reachability problem, where each process is allowed to perform a bounded number of phases during a run of the system. In a given phase,...